Search results for "design [accelerator]"
showing 10 items of 594 documents
On the Heuristic Procedure to Determine Processing Parameters in Additive Manufacturing Based on Materials Extrusion
2020
We present a heuristic procedure for determining key processing parameters (PPs) in materials-extrusion-based additive manufacturing processes. The concept relies on a design-of-experiment approach and consists of eleven &ldquo
The use of exploratory experimental designs combined with thermal numerical modelling to obtain a predictive tool for hybrid laser/MIG welding and co…
2011
Abstract While hybrid laser welding and coating processes involve a large number of physical phenomena, it is currently impossible to predict, for a given set of influencing factors, the shape of the molten zone and the history of temperature fields inside the parts. This remains true for complex processes, such as the hybrid laser/MIG welding process, which consists in combining a laser beam with a MIG torch. The gains obtained result essentially from the synergy of the associated processes: the stability of the process, the quality of the seam realized, and the productivity are increased. This article shows how, by means of a reduced number of experiments (8), it is possible to predict th…
A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands
2021
Abstract The Time Capacitated Arc Routing Problem (TCARP) extends the classical Capacitated Arc Routing Problem by considering time-based capacities instead of traditional loading capacities. In the TCARP, the costs associated with traversing and servicing arcs, as well as the vehicle’s capacity, are measured in time units. The increasing use of electric vehicles and unmanned aerial vehicles, which use batteries of limited duration, illustrates the importance of time-capacitated routing problems. In this paper, we consider the TCARP with stochastic demands, i.e.: the actual demands on each edge are random variables which specific values are only revealed once the vehicle traverses the arc. …
Game Theoretic Decentralized Feedback Controls in Markov Jump Processes
2017
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field games with large number of players. Building on a state-space extension technique, we turn the problem into an optimal control one for each single player. The main contribution is an explicit expression of the optimal decentralized control which guarantees the convergence both to local and to global equilibrium points. Furthermore, we study the stability of the system also in the presence of a delay which we model using an hysteresis operator. As a result of the hysteresis, we prove existence of multiple equilibrium points and analyze convergence conditions. The stability of the system is ill…
The probabilistic pickup-and-delivery travelling salesman problem
2019
Abstract Transportation problems are essential in commercial logistics and have been widely studied in the literature during the last decades. Many of them consist in designing routes for vehicles to move commodities between locations. This article approaches a pickup-and-delivery single-vehicle routing problem where there is susceptibility to uncertainty in customer requests. The probability distributions of the requests are assumed to be known, and the objective is to design an a priori route with minimum expected length. The problem has already been approached in the literature, but through a heuristic method. This article proposes the first exact approach to the problem. Two mathematica…
Reducing sample size in experiments with animals: historical controls and related strategies
2015
Reducing the number of animal subjects used in biomedical experiments is desirable for ethical and practical reasons. Previous reviews of the benefits of reducing sample sizes have focused on improving experimental designs and methods of statistical analysis, but reducing the size of control groups has been considered rarely. We discuss how the number of current control animals can be reduced, without loss of statistical power, by incorporating information from historical controls, i.e. subjects used as controls in similar previous experiments. Using example data from published reports, we describe how to incorporate information from historical controls under a range of assumptions that mig…
Application of modern computer algebra systems in food formulations and development: A case study
2017
Abstract Background Nutritional security determines the level of public health within a population while inadequate nutrition is one of the major factors in development of various health problems. This can be alleviated with sufficient and affordable access to currently available or newly designed nutritious foods. Scope and approach Formulation of new foods can be very costly, so methods able to lower design expanses are of utmost importance to the industry. Hence, the purpose of this work was to rationalize utilization of modern computerized algebraic systems (CAS) in solving traditional problems for formulating food mixtures by food combinatoric principles (FCP). Key findings and conclus…
Exploring Design Cognition in Voice-Driven Sound Sketching and Synthesis
2021
Conceptual design and communication of sonic ideas are critical, and still unresolved aspects of current sound design practices, especially when teamwork is involved. Design cognition studies in the visual domain represent a valuable resource to look at, to better comprehend the reasoning of designers when they approach a sound-based project. A design exercise involving a team of professional sound designers is analyzed, and discussed in the framework of the Function-Behavior-Structure ontology of design. The use of embodied sound representations of concepts fosters team-building and a more effective communication, in terms of shared mental models.
A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem
2016
The generalized directed rural postman problem, also known as the close-enough arc routing problem, is an arc routing problem with some interesting real-life applications, such as routing for meter reading. In this article we introduce two new formulations for this problem as well as various families of new valid inequalities that are used to design and implement a branch-and-cut algorithm. The computational results obtained on test bed instances from the literature show that this algorithm outperforms the existing exact methods
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
2019
The split delivery vehicle routing problem with time windows (SDVRPTW) is a notoriously hard combinatorial optimization problem. First, it is hard to find a useful compact mixed-integer programming (MIP) formulation for the SDVRPTW. Standard modeling approaches either suffer from inherent symmetries (mixed-integer programs with a vehicle index) or cannot exactly capture all aspects of feasibility. Because of the possibility to visit customers more than once, the standard mechanisms to propagate load and time along the routes fail. Second, the lack of useful formulations has rendered any direct MIP-based approach impossible. Up to now, the most effective exact algorithms for the SDVRPTW hav…